Mean shift based object tracking with accurate centroid estimation and adaptive Kernel bandwidth

نویسندگان

  • Krishna Warhade
  • Vijay Wadhai
  • Nitin Choudhari
چکیده

The object tracking algorithms based on mean shift are good and efficient. But they have limitations like inaccuracy of target localization and sometimes complete tracking failure. These difficulties arises because of the fact that in basic kernel based mean shift tracking algorithm, the centroid is not always at the centre of the target and the size of tracking window remains constant even if there is a major change in the size of object. It causes introduction of large number of background pixels in the object model which give localization errors or complete tracking failure. To deal with these challenges a new robust tracking algorithm based on edge based centroid calculation and automatic kernel bandwidth selection is proposed in this paper. This approach includes relocation of the track window on the middle of the target object in every frame and automatic size adjustment of tracking window so that minimum background pixels will be introduced in object model. The proposed algorithm show good results for almost all the tracking challenges faced by basic mean shift kernel tracking method.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Using a Novel Concept of Potential Pixel Energy for Object Tracking

Abstract   In this paper, we propose a new method for kernel based object tracking which tracks the complete non rigid object. Definition the union image blob and mapping it to a new representation which we named as potential pixels matrix are the main part of tracking algorithm. The union image blob is constructed by expanding the previous object region based on the histogram feature. The pote...

متن کامل

اصلاح ردیاب انتقال متوسط برای ردگیری هدف با الگوی تابشی متغیر

The mean shift algorithm is one of the popular methods in visual tracking for non-rigid moving targets. Basically, it is able to locate repeatedly the central mode of a desirable target. Object representation in mean shift algorithm is based on its feature histogram within a non-oriented individual kernel mask. Truly, adjusting of the kernel scale is the most critical challenge in this method. ...

متن کامل

Kernel Bandwidth Adaptive Target Tracking Algorithm Based on Mean - Shift

The kernel bandwidth of the classical Mean-Shift tracking algorithm is fixed, and it usually results in tracking failure when the target’s size changes. A kernel bandwidth adaptive Mean-Shift tracking algorithm is presented with frame difference method to solve the question in this paper. According to the targets’ size obtained from the inter-frame difference method, the bandwidth matrix of ker...

متن کامل

Improved Kernel-Based Object Tracking Under Occluded Scenarios

A successful approach for object tracking has been kernel based object tracking [1] by Comaniciu et al.. The method provides an effective solution to the problems of representation and localization in tracking. The method involves representation of an object by a feature histogram with an isotropic kernel and performing a gradient based mean shift optimization for localizing the kernel. Though ...

متن کامل

Adaptive Shape Kernel-Based Mean Shift Tracker in Robot Vision System

This paper proposes an adaptive shape kernel-based mean shift tracker using a single static camera for the robot vision system. The question that we address in this paper is how to construct such a kernel shape that is adaptive to the object shape. We perform nonlinear manifold learning technique to obtain the low-dimensional shape space which is trained by training data with the same view as t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014